0.03/0.13 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.03/0.13 % Command : run_E %s %d THM 0.13/0.34 % Computer : n016.cluster.edu 0.13/0.34 % Model : x86_64 x86_64 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.13/0.34 % Memory : 8042.1875MB 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64 0.13/0.34 % CPULimit : 1440 0.13/0.34 % WCLimit : 180 0.13/0.34 % DateTime : Thu Jul 4 07:11:23 EDT 2024 0.13/0.34 % CPUTime : 0.20/0.49 Running higher-order theorem proving 0.20/0.50 Running: /export/starexec/sandbox2/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=180 /export/starexec/sandbox2/tmp/tmp.V0ep0QZtOT/E---3.1_10702.p 30.11/4.34 # Version: 3.2.0-ho 30.11/4.34 # Preprocessing class: HSMSSMSSSSSNHHA. 30.11/4.34 # Scheduled 6 strats onto 8 cores with 180 seconds (1440 total) 30.11/4.34 # Starting full_lambda_6 with 540s (3) cores 30.11/4.34 # Starting post_as_ho1 with 180s (1) cores 30.11/4.34 # Starting lpo6_lambda_fix with 180s (1) cores 30.11/4.34 # Starting ho_unfolding_1 with 180s (1) cores 30.11/4.34 # Starting new_ho_10_unif with 180s (1) cores 30.11/4.34 # Starting ho_unfolding_2 with 180s (1) cores 30.11/4.34 # new_ho_10_unif with pid 10784 completed with status 0 30.11/4.34 # Result found by new_ho_10_unif 30.11/4.34 # Preprocessing class: HSMSSMSSSSSNHHA. 30.11/4.34 # Scheduled 6 strats onto 8 cores with 180 seconds (1440 total) 30.11/4.34 # Starting full_lambda_6 with 540s (3) cores 30.11/4.34 # Starting post_as_ho1 with 180s (1) cores 30.11/4.34 # Starting lpo6_lambda_fix with 180s (1) cores 30.11/4.34 # Starting ho_unfolding_1 with 180s (1) cores 30.11/4.34 # Starting new_ho_10_unif with 180s (1) cores 30.11/4.34 # No SInE strategy applied 30.11/4.34 # Search class: HGHNF-FFSF22-SHHFFSBN 30.11/4.34 # Scheduled 5 strats onto 1 cores with 180 seconds (180 total) 30.11/4.34 # Starting new_ho_10_unif with 60s (1) cores 30.11/4.34 # new_ho_10_unif with pid 10787 completed with status 0 30.11/4.34 # Result found by new_ho_10_unif 30.11/4.34 # Preprocessing class: HSMSSMSSSSSNHHA. 30.11/4.34 # Scheduled 6 strats onto 8 cores with 180 seconds (1440 total) 30.11/4.34 # Starting full_lambda_6 with 540s (3) cores 30.11/4.34 # Starting post_as_ho1 with 180s (1) cores 30.11/4.34 # Starting lpo6_lambda_fix with 180s (1) cores 30.11/4.34 # Starting ho_unfolding_1 with 180s (1) cores 30.11/4.34 # Starting new_ho_10_unif with 180s (1) cores 30.11/4.34 # No SInE strategy applied 30.11/4.34 # Search class: HGHNF-FFSF22-SHHFFSBN 30.11/4.34 # Scheduled 5 strats onto 1 cores with 180 seconds (180 total) 30.11/4.34 # Starting new_ho_10_unif with 60s (1) cores 30.11/4.34 # Preprocessing time : 0.001 s 30.11/4.34 # Presaturation interreduction done 30.11/4.34 30.11/4.34 # Proof found! 30.11/4.34 # SZS status Theorem 30.11/4.34 # SZS output start CNFRefutation 30.11/4.34 thf(decl_sort1, type, a: $tType). 30.11/4.34 thf(decl_22, type, epred1_0: a > a > $o). 30.11/4.34 thf(decl_23, type, esk1_0: (a > $o) > a). 30.11/4.34 thf(decl_24, type, esk2_2: (a > $o) > a > a). 30.11/4.34 thf(decl_25, type, esk3_0: a > a). 30.11/4.34 thf(cTHM145_A_pme, conjecture, ![X1:a > a > $o, X2:(a > $o) > a]:((![X3:a > a]:((?[X4:a]:(((X1 @ (X3 @ X4) @ X4)&(X1 @ X4 @ (X3 @ X4))))<=(![X5:a, X6:a]:(((X1 @ X5 @ X6)=>(X1 @ (X3 @ X5) @ (X3 @ X6))))&![X5:a, X6:a]:(((X1 @ X5 @ X6)=>(X1 @ (X3 @ X5) @ (X3 @ X6)))))))<=(![X7:a > $o]:(((![X8:a]:(((X7 @ X8)=>(X1 @ X8 @ (X2 @ X7))))&![X8:a]:(((X7 @ X8)=>(X1 @ X8 @ (X2 @ X7)))))&![X9:a]:((((X1 @ (X2 @ X7) @ X9)&(X1 @ (X2 @ X7) @ X9))<=![X10:a]:((((X7 @ X10)&(X7 @ X10))=>(X1 @ X10 @ X9)))))))&![X5:a, X6:a, X8:a]:((((X1 @ X6 @ X8)&(X1 @ X5 @ X6))=>(X1 @ X5 @ X8)))))), file('/export/starexec/sandbox2/tmp/tmp.V0ep0QZtOT/E---3.1_10702.p', cTHM145_A_pme)). 30.11/4.34 thf(c_0_1, negated_conjecture, ~(![X1:a > a > $o, X2:(a > $o) > a]:(((![X7:a > $o]:((![X8:a]:(((X7 @ X8)=>(X1 @ X8 @ (X2 @ X7))))&![X9:a]:((![X10:a]:(((X7 @ X10)=>(X1 @ X10 @ X9)))=>(X1 @ (X2 @ X7) @ X9)))))&![X5:a, X6:a, X8:a]:((((X1 @ X6 @ X8)&(X1 @ X5 @ X6))=>(X1 @ X5 @ X8))))=>![X3:a > a]:((![X5:a, X6:a]:(((X1 @ X5 @ X6)=>(X1 @ (X3 @ X5) @ (X3 @ X6))))=>?[X4:a]:(((X1 @ (X3 @ X4) @ X4)&(X1 @ X4 @ (X3 @ X4))))))))), inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[cTHM145_A_pme])])). 30.11/4.34 thf(c_0_2, negated_conjecture, ![X29:a > $o, X30:a, X31:a, X33:a, X34:a, X35:a, X37:a, X38:a, X39:a]:(((((~(X29 @ X30)|(epred1_0 @ X30 @ (esk1_0 @ X29)))&(((X29 @ (esk2_2 @ X29 @ X31))|(epred1_0 @ (esk1_0 @ X29) @ X31))&(~(epred1_0 @ (esk2_2 @ X29 @ X31) @ X31)|(epred1_0 @ (esk1_0 @ X29) @ X31))))&(~(epred1_0 @ X34 @ X35)|~(epred1_0 @ X33 @ X34)|(epred1_0 @ X33 @ X35)))&((~(epred1_0 @ X37 @ X38)|(epred1_0 @ (esk3_0 @ X37) @ (esk3_0 @ X38)))&(~(epred1_0 @ (esk3_0 @ X39) @ X39)|~(epred1_0 @ X39 @ (esk3_0 @ X39)))))), inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_1])])])])])])). 30.11/4.34 thf(c_0_3, negated_conjecture, ![X6:a, X5:a, X4:a]:(((epred1_0 @ X6 @ X5)|~((epred1_0 @ X4 @ X5))|~((epred1_0 @ X6 @ X4)))), inference(split_conjunct,[status(thm)],[c_0_2])). 30.11/4.34 thf(c_0_4, negated_conjecture, ![X7:a > $o, X4:a]:(((X7 @ (esk2_2 @ X7 @ X4))|(epred1_0 @ (esk1_0 @ X7) @ X4))), inference(split_conjunct,[status(thm)],[c_0_2])). 30.11/4.34 thf(c_0_5, negated_conjecture, ![X3:a > a, X4:a, X13:a > a, X5:a]:(((epred1_0 @ (X3 @ (esk2_2 @ (^[Z0/* 3 */:a]:((epred1_0 @ (X3 @ Z0) @ (X13 @ Z0)))) @ X4)) @ X5)|(epred1_0 @ (esk1_0 @ (^[Z0/* 3 */:a]:((epred1_0 @ (X3 @ Z0) @ (X13 @ Z0))))) @ X4)|~((epred1_0 @ (X13 @ (esk2_2 @ (^[Z0/* 3 */:a]:((epred1_0 @ (X3 @ Z0) @ (X13 @ Z0)))) @ X4)) @ X5)))), inference(spm,[status(thm)],[c_0_3, c_0_4])). 30.11/4.34 thf(c_0_6, negated_conjecture, ![X4:a, X5:a]:(((epred1_0 @ (esk3_0 @ X4) @ (esk3_0 @ X5))|~((epred1_0 @ X4 @ X5)))), inference(split_conjunct,[status(thm)],[c_0_2])). 30.11/4.34 thf(c_0_7, negated_conjecture, ![X7:a > $o, X4:a]:(((epred1_0 @ X4 @ (esk1_0 @ X7))|~((X7 @ X4)))), inference(split_conjunct,[status(thm)],[c_0_2])). 30.11/4.34 thf(c_0_8, negated_conjecture, ![X3:a > a, X4:a, X13:a > a, X5:a]:(((epred1_0 @ (X3 @ (esk2_2 @ (^[Z0/* 3 */:a]:((epred1_0 @ (X3 @ Z0) @ (esk3_0 @ (X13 @ Z0))))) @ X4)) @ (esk3_0 @ X5))|(epred1_0 @ (esk1_0 @ (^[Z0/* 3 */:a]:((epred1_0 @ (X3 @ Z0) @ (esk3_0 @ (X13 @ Z0)))))) @ X4)|~((epred1_0 @ (X13 @ (esk2_2 @ (^[Z0/* 3 */:a]:((epred1_0 @ (X3 @ Z0) @ (esk3_0 @ (X13 @ Z0))))) @ X4)) @ X5)))), inference(spm,[status(thm)],[c_0_5, c_0_6])). 30.11/4.34 thf(c_0_9, negated_conjecture, ![X1:a > a > $o, X4:a]:(((epred1_0 @ (esk2_2 @ (^[Z0/* 3 */:a]:((X1 @ Z0 @ Z0))) @ X4) @ (esk1_0 @ (^[Z0/* 3 */:a]:((X1 @ Z0 @ Z0)))))|(epred1_0 @ (esk1_0 @ (^[Z0/* 3 */:a]:((X1 @ Z0 @ Z0)))) @ X4))), inference(spm,[status(thm)],[c_0_7, c_0_4])). 30.11/4.34 thf(c_0_10, negated_conjecture, ![X7:a > $o, X4:a]:(((epred1_0 @ (esk1_0 @ X7) @ X4)|~((epred1_0 @ (esk2_2 @ X7 @ X4) @ X4)))), inference(split_conjunct,[status(thm)],[c_0_2])). 30.11/4.34 thf(c_0_11, negated_conjecture, ![X4:a]:(((epred1_0 @ (esk2_2 @ (^[Z0/* 3 */:a]:((epred1_0 @ Z0 @ (esk3_0 @ Z0)))) @ X4) @ (esk3_0 @ (esk1_0 @ (^[Z0/* 3 */:a]:((epred1_0 @ Z0 @ (esk3_0 @ Z0)))))))|(epred1_0 @ (esk1_0 @ (^[Z0/* 3 */:a]:((epred1_0 @ Z0 @ (esk3_0 @ Z0))))) @ X4))), inference(spm,[status(thm)],[c_0_8, c_0_9])). 30.11/4.34 thf(c_0_12, negated_conjecture, ![X3:a > a, X4:a]:(((epred1_0 @ (esk3_0 @ X4) @ (esk1_0 @ (^[Z0/* 3 */:a]:((epred1_0 @ Z0 @ (esk3_0 @ (X3 @ Z0)))))))|~((epred1_0 @ X4 @ (X3 @ (esk3_0 @ X4)))))), inference(spm,[status(thm)],[c_0_7, c_0_6])). 30.11/4.34 thf(c_0_13, negated_conjecture, (epred1_0 @ (esk1_0 @ (^[Z0/* 3 */:a]:((epred1_0 @ Z0 @ (esk3_0 @ Z0))))) @ (esk3_0 @ (esk1_0 @ (^[Z0/* 3 */:a]:((epred1_0 @ Z0 @ (esk3_0 @ Z0))))))), inference(spm,[status(thm)],[c_0_10, c_0_11])). 30.11/4.34 thf(c_0_14, negated_conjecture, ![X4:a]:((~((epred1_0 @ (esk3_0 @ X4) @ X4))|~((epred1_0 @ X4 @ (esk3_0 @ X4))))), inference(split_conjunct,[status(thm)],[c_0_2])). 30.11/4.34 thf(c_0_15, negated_conjecture, (epred1_0 @ (esk3_0 @ (esk1_0 @ (^[Z0/* 3 */:a]:((epred1_0 @ Z0 @ (esk3_0 @ Z0)))))) @ (esk1_0 @ (^[Z0/* 3 */:a]:((epred1_0 @ Z0 @ (esk3_0 @ Z0)))))), inference(spm,[status(thm)],[c_0_12, c_0_13])). 30.11/4.34 thf(c_0_16, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14, c_0_15]), c_0_13])]), ['proof']). 30.11/4.34 # SZS output end CNFRefutation 30.11/4.34 # Parsed axioms : 2 30.11/4.34 # Removed by relevancy pruning/SinE : 0 30.11/4.34 # Initial clauses : 7 30.11/4.34 # Removed in clause preprocessing : 1 30.11/4.34 # Initial clauses in saturation : 6 30.11/4.34 # Processed clauses : 878 30.11/4.34 # ...of these trivial : 170 30.11/4.34 # ...subsumed : 209 30.11/4.34 # ...remaining for further processing : 499 30.11/4.34 # Other redundant clauses eliminated : 0 30.11/4.34 # Clauses deleted for lack of memory : 0 30.11/4.34 # Backward-subsumed : 41 30.11/4.34 # Backward-rewritten : 58 30.11/4.34 # Generated clauses : 50845 30.11/4.34 # ...of the previous two non-redundant : 46357 30.11/4.34 # ...aggressively subsumed : 0 30.11/4.34 # Contextual simplify-reflections : 1 30.11/4.34 # Paramodulations : 50682 30.11/4.34 # Factorizations : 162 30.11/4.34 # NegExts : 0 30.11/4.34 # Equation resolutions : 1 30.11/4.34 # Disequality decompositions : 0 30.11/4.34 # Total rewrite steps : 4949 30.11/4.34 # ...of those cached : 4062 30.11/4.34 # Propositional unsat checks : 0 30.11/4.34 # Propositional check models : 0 30.11/4.34 # Propositional check unsatisfiable : 0 30.11/4.34 # Propositional clauses : 0 30.11/4.34 # Propositional clauses after purity: 0 30.11/4.34 # Propositional unsat core size : 0 30.11/4.34 # Propositional preprocessing time : 0.000 30.11/4.34 # Propositional encoding time : 0.000 30.11/4.34 # Propositional solver time : 0.000 30.11/4.34 # Success case prop preproc time : 0.000 30.11/4.34 # Success case prop encoding time : 0.000 30.11/4.34 # Success case prop solver time : 0.000 30.11/4.34 # Current number of processed clauses : 394 30.11/4.34 # Positive orientable unit clauses : 73 30.11/4.34 # Positive unorientable unit clauses: 0 30.11/4.34 # Negative unit clauses : 14 30.11/4.34 # Non-unit-clauses : 307 30.11/4.34 # Current number of unprocessed clauses: 45044 30.11/4.34 # ...number of literals in the above : 140874 30.11/4.34 # Current number of archived formulas : 0 30.11/4.34 # Current number of archived clauses : 105 30.11/4.34 # Clause-clause subsumption calls (NU) : 12683 30.11/4.34 # Rec. Clause-clause subsumption calls : 10842 30.11/4.34 # Non-unit clause-clause subsumptions : 239 30.11/4.34 # Unit Clause-clause subsumption calls : 2109 30.11/4.34 # Rewrite failures with RHS unbound : 0 30.11/4.34 # BW rewrite match attempts : 1969 30.11/4.34 # BW rewrite match successes : 62 30.11/4.34 # Condensation attempts : 878 30.11/4.34 # Condensation successes : 4 30.11/4.34 # Termbank termtop insertions : 11934656 30.11/4.34 # Search garbage collected termcells : 408 30.11/4.34 30.11/4.34 # ------------------------------------------------- 30.11/4.34 # User time : 3.525 s 30.11/4.34 # System time : 0.166 s 30.11/4.34 # Total time : 3.690 s 30.11/4.34 # Maximum resident set size: 1860 pages 30.11/4.34 30.11/4.34 # ------------------------------------------------- 30.11/4.34 # User time : 3.526 s 30.11/4.34 # System time : 0.168 s 30.11/4.34 # Total time : 3.694 s 30.11/4.34 # Maximum resident set size: 1728 pages 30.11/4.34 % E---3.1 exiting 30.11/4.34 % E exiting 30.11/4.34 EOF